Algebra and the Complexity of Digraph CSPs: a Survey
نویسنده
چکیده
We present a brief survey of some of the key results on the interplay between algebraic and graph-theoretic methods in the study of the complexity of digraph-based constraint satisfaction problems. 1998 ACM Subject Classification A.1 Introductory and Survey, D.3.2 Constraint and Logic Languages, F.2.2 Computations on Discrete Structures
منابع مشابه
Constraint Satisfaction Problems over Numeric Domains
We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert’s tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, an...
متن کاملDigraph related constructions and the complexity of digraph homomorphism problems
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic constructions. As applications we observe a collapse in the applicability of algorithms for CSPs over directed graphs with both a total source and a total sink: the c...
متن کاملBinarisation for Valued Constraint Satisfaction Problems
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulín et al. [LMCS’15] to VCSPs. This reduction establishes that VCSPs over a fi...
متن کاملA finer reduction of constraint problems to digraphs
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that the corresponding constraint satisfaction problem is logspace equivalent to that over A. Moreover, we show that almost all of the commonly encountered polymorp...
متن کاملA graph associated to spectrum of a commutative ring
Let $R$ be a commutative ring. In this paper, by using algebraic properties of $R$, we study the Hase digraph of prime ideals of $R$.
متن کامل